class MyCircularQueue {
    public int[] elem;
    public int front;
    public int rear;


    public MyCircularQueue(int k) {
        elem = new int[k];
    }

    /**
     * 入队
     * @param value
     * @return
     */
    public boolean enQueue(int value) {
        if(isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear+1) % elem.length;
        return true;
    }

    /**
     * 出队
     * @return
     */
    public boolean deQueue() {
        if(isEmpty()){
            return false;
        }
        front = (front+1) %elem.length;
return true;
    }
    
    public int Front() {
        return elem[front];

    }
    
    public int Rear() {
        if(rear == 0){
            return elem[elem.length-1];
        }
        return elem[rear-1];
    }
    
    public boolean isEmpty() {
      return  rear == front;

    }
    
    public boolean isFull() {
        return (rear+1) % elem.length == front;

    }
}